Bounds on the Expected Size of the Maximum Agreement Subtree
نویسندگان
چکیده
We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem.
منابع مشابه
Kaikoura Information Processing Letters tree theorems : Computing the maximum agreement subtree
The Maximum Agreement Subtree Problem was posed by Finden and Gordon in 1985, and is as follows: given a set S={s,, sz,..., s,,} and two trees P and Q leaf-labelled by the elements of S, find a maximum cardinality subset S, of S such that PI S, = Q IS,. This problem arises in evolutionary tree construction, where different methods or data yield (possibly) different trees for the same species on...
متن کاملBalanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient construction of evolutionary trees: a new upper time-bound on the problem of constructing an evolutionary tree from experiments, and a relatively fast approximation algorithm for the maximum agreement subtree problem ...
متن کاملBounds on $m_r(2,29)$
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in PG(2, q) is denoted by $m_r(2,q)$. In this paper thirteen new $(n, r)$-arc in PG(2,,29) and a table with the best known lower and upper bounds on $m_r(2,29)$ are presented. The results are obtained by non-exhaustive local computer search.
متن کاملMaximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms
The maximum agreement subtree approach is one method of reconciling different evolutionary trees for the same set of species. An agreement subtree enables choosing a subset of the species for whom the restricted subtree is equivalent (under a suitable definition) in all given evolutionary trees. Recently, dynamic programming ideas were used to provide polynomial time algorithms for finding a ma...
متن کاملAn improved bound on the maximum agreement subtree problem
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 29 شماره
صفحات -
تاریخ انتشار 2015